Scheduling ships with uncertain arrival times through the Kiel Canal
نویسندگان
چکیده
منابع مشابه
Managing uncertain arrival times through sociomaterial associations
Interest in how individuals cope with uncertainty when scheduling their activities and trips has increased in recent years.While providing many useful concepts and insights, previous work tends to treat individuals as atomised decision-making units. This paper argues that it is imperative to think of persons coping with uncertainty about the duration of activities and trips as agents in wider s...
متن کاملShift-scheduling of Call Centers with Uncertain Arrival Parameters
This paper considers a multi-periodic multi-shift call center staffing problem with two types of jobs: calls and emails. The arrival rate of calls is random and the workforce presents some flexibility: the agents can be affected to one job type in real-time. At each period of the day, a service quality constraint limits the waiting time for a call. The staffing problem is modeled as a newsboy-t...
متن کاملShip Traffic Optimization for the Kiel Canal
We introduce, discuss, and solve a hard practical optimization problem which we call the ship traffic control problem (STCP). Since we plan bi-directional traffic, STCP relates to, and in fact generalizes train timetabling on single-track networks. The objective of finding quickest routes motivates the integration of recent algorithmic ideas from dynamic collision-free routing of automated guid...
متن کاملProject Scheduling Problem with Uncertain Activity Duration Times
Project scheduling problem is to determine the schedule of allocating resources so as to balance the total cost and the completion time. This paper considers project scheduling problem with uncertain activity duration times and presents four new uncertain programming models for different management requirements. Moreover, taking advantage of some properties of uncertainty theory, these models c...
متن کاملUsing Inter-Arrival Times For Scheduling In Non-Observable Queues
In online dispatching systems, when there is no opportunity to observe the state of the systems’ components, one may implement “blind” scheduling policies i.e. those which use incomplete/indirect observations of the system state or do not use any information at all. Here we deal with the well-known problem of scheduling in several non-observable parallel single server queues with single Poisson...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Maritime Transport Research
سال: 2021
ISSN: 2666-822X
DOI: 10.1016/j.martra.2020.100008